Slacken Piercing Point Based Subproblem Algorithm for the LP Relaxation of Crew Rostering
نویسنده
چکیده
Crew rostering is one of the most important scheduling problems that airlines have to face regularly. The goal is to assign a set of tasks to a group of workers as fairly as possible while following various business rules. Difficulties of the optimization mainly arise from its large scale. In this paper, a modified subproblem based algorithm for the LP relaxations of crew rostering problem is proposed, whose benefit comes from two main ideas. Firstly, it needn’t consider all non-basic variables in any iteration. Secondly, it is beneficial to consider primal and dual problems at the same time. The computational experiments on the real-world problems showed that time savings about 50% over previous universal subproblem based algorithm can be obtained.
منابع مشابه
Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملModeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines
This paper studies the modeling and algorithms of crew roster problem with given cycle on highspeed railway lines. Two feasible compilation strategies for work out the crew rostering plan are discussed, and then an integrated compilation method is proposed in this paper to obtain a plan with relatively higher regularity in execution and lower crew members arranged. The process of plan making is...
متن کاملAlgorithms Based on LP Relaxations for Combinatorial Optimization Problems
We survey the main results presented in the author's Ph.D Thesis 12], which addresses the use of Linear Programming (LP) relaxations within exact and heuristic algorithms for the solution of some Combinatorial Optimization (CO) problems arising from real-life applications. It is well known that CO problems admit several possible Integer LP (ILP) formulations, and the corresponding LP relaxation...
متن کاملSolving Airline’s Pilot – Copilot Rostering Problem by Successive Bipartite Weighted Matching
In large airlines, the planning and scheduling of aircrafts and crews is a very important operation. It starts from the analysis of the customers’ demands, passes the stages including timetable construction, fleet planning, and crew pairing, finally ends up with crew rostering. During the past decades, researches had been focused on two complex problems: crew pairing problem and crew rostering ...
متن کاملRosterBuilder - An Architecture for an Integrated Airline Rostering Framework
Rostering is a crucial planning process in an airline’s overall scheduling hierarchy. Besides addressing the issues of crew utilisation and crew costs (which represent two of the major expenses in running an airline), a rostering tool must also cover the question of quality requirements. The quality of service can be improved by having the rostering tool take into consideration the skills of in...
متن کامل